Frankenstein's glue: transition functions for approximate solutions
نویسندگان
چکیده
منابع مشابه
Frankenstein’s Glue: Transition functions for approximate solutions
Approximations are commonly employed to find approximate solutions to the Einstein equations. These solutions, however, are usually only valid in some specific spacetime region. A global solution can be constructed by gluing approximate solutions together, but this procedure is difficult because discontinuities can arise, leading to large violations of the Einstein equations. In this paper, we ...
متن کاملApproximate Solutions for Indifference Pricing under General Utility Functions
With the aid of Taylor-based approximations, this paper presents results for pricing insurance contracts by using indifference pricing under general utility functions. We discuss the connection between the resulting “theoretical” indifference prices and the pricing rule-of-thumb that practitioners use: Best Estimate plus a “Market Value Margin”. Furthermore, we compare our approximations with k...
متن کاملCut, Glue, & Cut: A Fast, Approximate Solver for Multicut Partitioning
Recently, unsupervised image segmentation has become increasingly popular. Starting from a superpixel segmentation, an edge-weighted region adjacency graph is constructed. Amongst all segmentations of the graph, the one which best conforms to the given image evidence, as measured by the sum of cut edge weights, is chosen. Since this problem is NP-hard, we propose a new approximate solver based ...
متن کاملClassiiers That Approximate Functions Classiiers That Approximate Functions
A classiier system, XCSF, is introduced in which the prediction estimation mechanism is used to learn approximations to functions. The addition of weight vectors to the classiiers allows piecewise-linear approximation, where the classiier's prediction is calculated instead of being a xed scalar. The weight vector and the classiier's condition co-adapt. Results on functions of up to six dimensio...
متن کاملOptimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Classical and Quantum Gravity
سال: 2007
ISSN: 0264-9381,1361-6382
DOI: 10.1088/0264-9381/24/17/004